RGB Subdivision Enrico Puppo , Member , IEEE , and Daniele Panozzo
نویسنده
چکیده
We introduce the RGB Subdivision: an adaptive subdivision scheme for triangle meshes, which is based on the iterative application of local refinement and coarsening operators, and generates the same limit surface of the Loop subdivision, independently on the order of application of local operators. Our scheme supports dynamic selective refinement, as in Continuous Level Of Detail models, and it generates conforming meshes at all intermediate steps. The RGB subdivision is encoded in a standard topological data structure, extended with few attributes, which can be used directly for further processing. We present an interactive tool that permits to start from a base mesh and use RGB subdivision to dynamically adjust its level of detail.
منابع مشابه
Interpolatory Adaptive Subdivision for Mesh LOD Editing
We propose an adaptive interpolatory scheme for subdivided triangle meshes that is compliant with the modified butterfly subdivision and can be used effectively and efficiently in selective editing of meshes. Our scheme is developed upon the RGB subdivision, an adaptive scheme that is based on the factorization of the one-tofour triangle split pattern. We introduce the concept of topological an...
متن کاملSimplification of cross-field topology
We present an innovative algorithm that simplifies the topology of a cross-field. Our algorithm works through macro-operations that allow us editing the graph of separatrices, which is extracted from a cross-field, while maintaining it topologically consistent. We present preliminary results of our implementation.
متن کاملImplicit Hierarchical Quad-Dominant Meshes
We present a method for producing quad-dominant subdivided meshes, which supports both adaptive refinement and adaptive coarsening. A hierarchical structure is stored implicitly in a standard half-edge data structure, while allowing us to efficiently navigate through the different level of subdivision. Subdivided meshes contain a majority of quad elements and a moderate amount of triangles and ...
متن کاملAdaptive Quad Mesh Simplification
We present an improved algorithm for the progressive simplification of quad meshes, which adapts the resolution of the mesh to details of the modeled shape. We extend previous work [TPC∗10], by simplifying the approach and combining it with the concept of Fitmaps introduced in [PPT∗10]. The new algorithm has several advantages: it is simpler and more robust; it does not need a parametrization o...
متن کاملFast Neighborhood Search on Polygonal Meshes
We introduce a spatial index to support the fast retrieval of large neighborhoods of points on a polygonal mesh. Our spatial index can be computed efficiently off-line, introducing a negligible overhead over a standard indexed data structure. In retrieving neighborhoods of points on-line, we achieve a speed-up of about one order of magnitude with respect to standard topological traversal, while...
متن کامل